Quantum Magnetism and Topological Ordering via Rydberg Dressing near Förster Resonances
نویسندگان
چکیده
منابع مشابه
Quantum magnetism and topological ordering via enhanced Rydberg-dressing near Förster-resonances
We devise a cold-atom approach to realizing a broad range of bi-linear quantum magnets. Our scheme is based on off-resonant single-photon excitation of Rydberg P -states (Rydberg-dressing), whose strong interactions are shown to yield controllable XYZ-interactions between effective spins, represented by different atomic ground states. The distinctive features of Förster-resonant Rydberg atom in...
متن کاملEnhancement of Rydberg-mediated single-photon nonlinearities by electrically tuned Förster resonances
Mapping the strong interaction between Rydberg atoms onto single photons via electromagnetically induced transparency enables manipulation of light at the single-photon level and few-photon devices such as all-optical switches and transistors operated by individual photons. Here we demonstrate experimentally that Stark-tuned Förster resonances can substantially increase this effective interacti...
متن کاملExcitation transport through Rydberg dressing
We show how to create long-range interactions between alkali atoms in different hyperfine ground states, with the goal of coherent quantum transport. The scheme uses off-resonant dressing with atomic Rydberg states. We demonstrate coherent migration of electronic excitation through dressed dipole–dipole interaction by full solutions of models with four essential states per atom and give the str...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2015
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.114.243002